A Practically Implementable and Tractable Delegation Logic
نویسندگان
چکیده
We address the goal of making Delegation Logic (DL) into a practically implementable and tractable trustmanagement system. DL [22] is a logic-based knowledge representation (i.e., language) for authorization in largescale, open, distributed systems. As introduced in [22], DL inferencing is computationally intractable and highly impractical to implement. We introduce a new version of Delegation Logic that remedies these difficulties. To achieve this, we impose a syntactic restriction and redefine the semantics somewhat. We show that, for this revised version of DL, inferencing is computationally tractable under the same commonly met restrictions for which Ordinary Logic Programs (OLP) inferencing is tractable (e.g., Datalog and bounded number of logical variables per rule). We give an implementation architecture for this version of DL; it uses a delegation compiler from DL to OLP and can modularly exploit a variety of existing OLP inference engines. As proof of concept, we have implemented a large expressive subset of this version of DL, using this architecture. This paper appears in Proceedings of the IEEE 2000 Symposium on Security and Privacy. The expanded Research Report version of this paper gives additional details, including sample output of the implementation.
منابع مشابه
A Nonmonotonic Delegation Logic with Prioritized Conflict Handling
We extend previous work on Delegation Logic (DL) [11, 12], a tractable and practically implementable logic-based language for authorization in large-scale, open, distributed systems. We expressively generalize the previous version of DL (called D1LP) to have nonmonotonic expressive features, including negation-as-failure, classical negation, and prioritized conflict handling. The resulting form...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملAn implementable scheme for secure delegation of computing and data
The need for delegating information arises when the data owner wants to have her data handled by an external party. If the external party is untrusted and data are confidential, delegation should be performed in a way that preserves security. Uses of delegation range from public administration to smart cards. In this paper, correctness and security requirements as well as protocols are specifie...
متن کاملAn Implementable Scheme for Secure
The need for delegating information arises when the data owner wants to have her data handled by an external party. If the external party is untrusted and data are conndential, delegation should be performed in a way that preserves security. Uses of delegation range from public administration to smart cards. In this paper, correctness and security requirements as well as protocols are speciied ...
متن کاملOptimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+
We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the fragment ATL of the full Alternating time temporal logic ATL∗. The method extends in an essential way a previously developed tableaux-based decision method for ATL and works in 2EXPTIME, which is the optimal worst case complexity of the sat...
متن کامل